OMP with Highly Coherent Dictionaries

نویسندگان

  • Raja Giryes
  • Michael Elad
چکیده

Recovering signals that has a sparse representation from a given set of linear measurements has been a major topic of research in recent years. Most of the work dealing with this subject focus on the reconstruction of the signal’s representation as the means to recover the signal itself. This approach forces the dictionary to be of low-coherence and with no linear dependencies between its columns. Recently, a series of contributions show that such dependencies can be allowed by aiming at recovering the signal itself. However, most of these recent works consider the analysis framework, and only few discuss the synthesis model. This paper studies the synthesis and introduces a new mutual coherence definition for signal recovery, showing that a modified version of OMP can recover sparsely represented signals of a dictionary with very high correlations between pairs of columns. We show how the derived results apply to the plain OMP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mismatch and resolution in compressive imaging

Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and local optimization are proposed to enhance Orthogonal Matching Pursuit (OMP)...

متن کامل

Direction of arrival estimation using modified orthogonal matching pursuit algorithm

Direction of arrival (DOA) estimation is a sparse reconstruction problem. However, conventional orthogonal matching pursuit (OMP) may fail to identify the correct atoms since the redundant dictionary composed of the direction vectors is highly coherent. To mitigate the coherence problem, in this paper, we propose a modified OMP by constructing data dependent sensing dictionary for sparse recons...

متن کامل

Efficient Implementation of the K-SVD Algorithm and the Batch-OMP Method

The K-SVD algorithm is a highly effective method of training overcomplete dictionaries for sparse signal representation. In this report we discuss an efficient implementation of this algorithm, which both accelerates it and reduces its memory consumption. The two basic components of our implementation are the replacement of the exact SVD computation with a much quicker approximation, and the us...

متن کامل

Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit

The K-SVD algorithm is a highly effective method of training overcomplete dictionaries for sparse signal representation. In this report we discuss an efficient implementation of this algorithm, which both accelerates it and reduces its memory consumption. The two basic components of our implementation are the replacement of the exact SVD computation with a much quicker approximation, and the us...

متن کامل

Local orthogonal greedy pursuits for scalable sparse approximation of large signals with shift-invariant dictionaries

We propose a way to increase the speed of greedy pursuit algorithms for scalable sparse signal approximation. It is designed for dictionaries with localized atoms, such as timefrequency dictionaries. When applied to OMP, our modification leads to an approximation as good as OMP while keeping the computation time close to MP. Numerical experiments with a large audio signal show that, compared to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013